Reporting on authentication of RFID tags for indicating legitimacy of their associated items

ABSTRACT

RFID readers, computers, and methods are provided for reporting on the authentication of one or more RFID tags associated with a proffered item, while requiring special permissions be cleared before reporting. In some embodiments, a question is input about whether a Declared Password (DP) is regarded as proper for an Item Identifier (II), both of which have been input from the tags. An answer is generated for the question from the reference database, and transmitted to the user. The answer does not reveal an Actual Code that is indeed regarded as proper, unless the user first demonstrates they already know it. Beyond the authentication of the tag, the answer can further indicate the legitimacy of the proffered item, for a supply chain, at a Customs Office, etc.

RELATED APPLICATIONS

This utility patent application claims the benefit of U.S. ProvisionalApplication Ser. No. 60/749,864 filed on 2005 Dec. 12, which is herebyclaimed under 35 U.S.C. §119(e). The provisional application isincorporated herein by reference for all purposes.

The present application may be found to be related to U.S. patentapplication entitled: “HANDLING LEGITIMATE AND UNAUTHORIZED ITEMS INSUPPLY CHAIN ACCORDING TO AUTHENTICATION OF THEIR RFID TAGS”, Ser. No.11/637,372, filed with the USPTO on the same day as this patentapplication.

The present application may be found to be related to U.S. patentapplication entitled: “DETERMINING AUTHENTICATION OF RFID TAGS FORINDICATING LEGITIMACY OF THEIR ASSOCIATED ITEMS”, Ser. No. 11/637,479,filed with the USPTO on the same day as this patent application.

TECHNICAL FIELD

The present description addresses the field of Radio FrequencyIDentification (RFID) systems, and more specifically to systems, devicesand methods for reporting on whether RFID tags are authenticated, toindicate the legitimacy of items they are attached to.

BACKGROUND

Radio Frequency IDentification (RFID) systems typically include RFIDtags and RFID readers (the latter are also known as RFID reader/writersor RFID interrogators). RFID systems can be used in many ways forlocating and identifying objects to which the tags are attached. RFIDsystems are particularly useful in product-related and service-relatedindustries for tracking large numbers of objects being processed,inventoried, or handled. In such cases, an RFID tag is usually attachedto an individual item, or to its package.

In principle, RFID techniques entail using an RFID reader to interrogateone or more RFID tags. The reader transmitting a Radio Frequency (RF)wave performs the interrogation. A tag that senses the interrogating RFwave responds by transmitting back another RF wave. The tag generatesthe transmitted back RF wave either originally, or by reflecting back aportion of the interrogating RF wave in a process known as backscatter.Backscatter may take place in a number of ways.

The reflected-back RF wave may further encode data stored internally inthe tag, such as a number. The response is demodulated and decoded bythe reader, which thereby identifies, counts, or otherwise interactswith the associated item. The decoded data can denote a serial number, aprice, a date, a destination, other attribute(s), any combination ofattributes, and so on.

An RFID tag typically includes an antenna system, a power managementsection, a radio section, and frequently a logical section, a memory, orboth. In earlier RFID tags, the power management section included anenergy storage device, such as a battery. RFID tags with an energystorage device are known as active tags. Advances in semiconductortechnology have miniaturized the electronics so much that an RFID tagcan be powered solely by the RF signal it receives. Such RFID tags donot include an energy storage device, and are called passive tags.

A problem has been that legitimate supply chain activities areundermined by illegitimate activities. This problem is now described inmore detail.

FIG. 1 is a conceptual drawing of a legitimate supply chain 110. Variouslinks 120, 130, 140, 150, 160, 170, 180 are shown as circles, partiallyoverlapping at nodes to conceptually suggest a chain. Each one of theselinks shows a possible representative activity. A supply chain may haveany number of links, similar or different than the links of chain 110,and so on.

Link 120 is for a manufacturer 120, which manufactures an item 125. Item125 can be anything that is bought and sold for money, such as aconsumer good, a component for a consumer good, and so on. Item 125travels within the chain according to the general direction of arrow127. For example, item 125 can be transported according totransportation links 130 and 140, and then stored in a warehouse 150.Warehouse 150 can serve as a distribution center, from where item 125can be directed, via another transport link 160, to a desired retailoutlet 170. While there, it can be bought by consumer 180, for money185.

Money 185 ultimately pays for item 125. Here money 185 is showntraveling within chain 110 according to the general direction of arrow187, opposite of arrow 127, for paying for every one of the activitiesand services of chain 110. Payment, however, need not be made explicitlyat each node between successive links. Items can be manufactured anddelivered across links according to supply agreements, while payment ismade according to arrangements specified in related legal agreements.

FIG. 2 is a conceptual drawing of supply chain 110, further showing adomain 210 of illegitimate activities that undermine legitimate supplychain 110. Activities in domain 210 are sometimes called gray marketactivities, and include storing and transporting 211. In addition,counterfeiting 213 results in a counterfeit item 215 in domain 210.

Domain 210 also includes unauthorized overproduction 216 by amanufacturer 120. That is, even a legitimate manufacturer 120, afterfulfilling an order to manufacture a certain supply of items 125,manufactures more of them and sells them in the gray market. Domain 210can also include theft 226 from any link in chain 110, which results initem 125 being diverted into the gray market.

Items emerge from illegitimate domain 210 by a number of activities,such as introduction or reintroduction 237 into legitimate supply chain110, fraudulent returns 238 by some posing as consumers, and directsales 239 to consumers 180.

The illegitimate activities of domain 210 hurt honest businesses, and inturn consumers in the form of higher prices.

The problem of introduction or reintroduction 237 and fraudulent returns238 is now described in more detail.

FIG. 3 is a conceptual diagram showing an offered transaction 300 at alink 310. Link 310 can be a link of a legitimate supply chain, or at aninspection point, such as a Customs Office. A party 321, who is alsoknown as an offeror, offers according to arrow 327 an item 325 that isalso known as the proffered item. Proffered item 325 is offered foracceptance by an agent or operator 311 within link 310.

Agent 311 does not know whether proffered item 325 is legitimate or not.Agent 311 may be concerned about accepting items in such transactions,if the items are illegitimate. Indeed, the activity of offering (arrow327) could be part of the legitimate progress 127 of item 325 within asupply chain, or a fraudulent import, or a fraudulent reintroduction237, or even a fraudulent return 238.

The concern of agent 311 is shown by thought bubble 343. Should heaccept (387) the proffered item 325? Should he also pay or promise topay money 385 for it, or give it an import license 386?

Note that the concern is not alleviated by the fact that proffered item325 is even tagged by an RFID tag 320. The concern can also be whethertag 320 is legitimate, or stolen, counterfeit, cloned by replicating thedata of a legitimate tag, etc.

SUMMARY

The invention improves over the prior art.

More particularly, RFID readers, computers, software, and methods areprovided for reporting on the authentication of one or more RFID tagsassociated with a proffered item, while requiring special permissions becleared before reporting. In some embodiments, a question is input aboutwhether a Declared Password (DP) is regarded as proper for an ItemIdentifier (II), both of which have been input from the tags. An answeris generated for the question from the reference database, andtransmitted to the user. The answer does not reveal an Actual Code thatis indeed regarded as proper, unless the user first demonstrates that healready knows it.

Beyond the authentication of the RFID tag, the answer can furtherindicate the legitimacy of the proffered item. When an item's RFID tagdata is not authenticated, a conscientious person can refuse to acceptit; a Customs Agent can intercept it, etc. This will in turn diminishthe incentive for illegitimate activities.

The invention offers the advantage that protection is accomplished byhow the reference database is hosted. This avoids the need to adddefensive features to the RFID tags, so they could withstand attacks. Assuch, the expense of generating RFID tags need not increase.

These and other features and advantages of the invention will be betterunderstood from the specification of the invention, which includes thefollowing Detailed Description and accompanying Drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The following Detailed Description proceeds with reference to theaccompanying Drawings, in which:

FIG. 1 is a conceptual drawing of a legitimate supply chain.

FIG. 2 is a conceptual drawing of the supply chain of FIG. 1, furthershowing a domain of illegitimate activities that undermine thelegitimate supply chain.

FIG. 3 is a conceptual diagram showing an offered transaction at a linkof a legitimate supply chain, and a concern about accepting items insuch transactions that could be illegitimate as per an illegitimatereintroduction activity and fraudulent return activity of FIG. 2.

FIG. 4 is a diagram showing components of an RFID tag according toembodiments, which can be attached to a proffered item of FIG. 3.

FIG. 5 is a conceptual diagram showing an offered transaction at thesame link of a legitimate supply chain as in FIG. 3, along with anexample of how a previous concern about accepting items in suchtransactions can be resolved at least partially according to embodimentsif the RFID tag of FIG. 4 is used.

FIG. 6 is a flowchart illustrating particular methods according toembodiments for handling items in supply chain according toauthentication of their RFID tags.

FIG. 7 is a flowchart illustrating preferred embodiments of the methodsof FIG. 6.

FIG. 8 is a diagram showing an overall arrangement according toembodiments for a legitimate link of a supply chain to authenticate thetag of FIG. 5 and implementing a method of FIG. 6 and FIG. 7 beforeaccepting an item.

FIG. 9 is a diagram showing components of an RFID reader that can beimplemented in the arrangement of FIG. 8.

FIG. 10 is a block diagram illustrating an overall architecture of anRFID reader system according to embodiments that can be implemented inthe arrangement of FIG. 8.

FIG. 11 is a conceptual drawing of the legitimate supply chain of FIG.2, where some of the links are equipped like the link of FIG. 8, and alluse a single reference database for authenticating RFID tags accordingto embodiments, regardless of where the reference database is hosted.

FIG. 12 is a diagram of a partial section of a legitimate supply chainlike that of FIG. 11, where further a host of the reference database isimplemented separately from the supply chain according to embodiments.

FIG. 13 is a diagram of a partial section of a legitimate supply chainlike that of FIG. 11, where further a host of the reference database isimplemented within one of the links of the supply chain according toembodiments.

FIG. 14 is a block diagram according to embodiments for implementing ahost for a reference database, such as that of FIG. 8.

FIG. 15 is a flowchart illustrating methods to determine anauthentication of RFID tags according to embodiments, for indicating alegitimacy of their associated items.

FIG. 16 is a diagram showing individual communications according toembodiments for performing a method such as that of FIG. 15, thecommunications being encoded in question signals and answer signalstransmitted across a connection such as that of FIG. 8.

FIG. 17 is a diagram showing how data can be organized in a referencedatabase according to embodiments.

FIG. 18 is a diagram showing subsets of possible values of AssociatedCodes in the database of FIG. 17 according to embodiments.

FIG. 19 is a flowchart illustrating methods according to embodiments toreport on authentication of RFID tags, for indicating legitimacy oftheir associated items.

FIG. 20 is a conceptual diagram for illustrating that a host of areference database does not reveal an Associated Code, except if it isfirst demonstrated that a valid DP is already known.

FIG. 21 is the conceptual drawing of FIG. 11, further showing how anAssociated Code (AC) can be changed at different nodes of a legitimatesupply chain, to frustrate the activities of an illegitimate domain.

FIG. 22 is the diagram of FIG. 11, further showing an effect of usingthe invention.

DETAILED DESCRIPTION

The present invention is now described. While it is disclosed in itspreferred form, the specific embodiments of the invention as disclosedherein and illustrated in the drawings are not to be considered in alimiting sense. Rather, these embodiments are provided so that thisdisclosure will be thorough and complete, and will fully convey thescope of the invention to those skilled in the art. Indeed, it should bereadily apparent in view of the present description that the inventionmay be modified in numerous ways. Among other things, the presentinvention may be embodied as devices, methods, software, and so on.Accordingly, the present invention may take the form of an entirelyhardware embodiment, an entirely software embodiment or an embodimentcombining software and hardware aspects. This description is, therefore,not to be taken in a limiting sense.

As has been mentioned, the present invention includes a scheme forauthenticating RFID tags, to indicate the legitimacy of their associateditems. The scheme is now described in more detail.

FIG. 4 is a diagram of an RFID tag 420, which can be used for practicingthe invention. Tag 420 is implemented as a passive tag, meaning it doesnot have its own power source. Much of what is described in thisdocument, however, applies also to active tags.

Tag 420 is formed on a substantially planar inlay 422, which can be madein many ways known in the art. Tag 420 includes an electrical circuit,which is preferably implemented in an integrated circuit (IC) 424. IC424 is arranged on inlay 422.

Tag 420 also includes an antenna for exchanging wireless signals withits environment. The antenna is usually flat and attached to inlay 422.IC 424 is electrically coupled to the antenna via suitable antenna ports(not shown).

The antenna may be made in a number of ways, as is well known in theart. In the example of FIG. 4, the antenna is made from two distinctantenna segments 427, which are shown here forming a dipole. Many otherembodiments are possible, using any number of antenna segments.

In some embodiments, an antenna can be made with even a single segment.Different places of the segment can be coupled to one or more of theantenna ports of IC 424. For example, the antenna can form a singleloop, with its ends coupled to the ports. When the single segment hasmore complex shapes, it should be remembered that at, the frequencies ofRFID wireless communication, even a single segment could behave likemultiple segments.

In operation, a signal is received by the antenna, and communicated toIC 424. IC 424 both harvests power, and responds if appropriate, basedon the incoming signal and its internal state. In order to respond byreplying, IC 424 modulates the reflectance of the antenna, whichgenerates the backscatter from a wave transmitted by the reader.Coupling together and uncoupling the antenna ports of IC 424, in rapidsuccession, can modulate the reflectance, as can a variety of othermeans.

In the embodiment of FIG. 4, antenna segments 427 are separate from IC424. In other embodiments, antenna segments may alternately be formed onIC 424, and so on.

The electrical circuit in IC 424 includes a memory 430, which can storedata 432, 434, and optionally 436. These data are typically in the formof 0s and 1s, whose combination means something, either directlyaccording to protocols, or by encryption. Such data is written atdifferent portions of memory 430, as will be evident to a person skilledin the art, referenced by proper pointers, and so on. These data can becommunicated to an RFID reader that interrogates RFID tag 420, as willbe described later in this document.

In the example of FIG. 4, data 432 is for an Item Identifier (II).According to a comment 433, the II can be a code for identifying theitem that tag 420 is associated with. For more robustness, it ispreferable that, if RFID tagged items are presented in a group, each tag420 have its own unique II 432, although that is not necessary.

Any code can be used as an II, or a portion of an II. For example, theII can include a designation about the item, which is assigned accordingto a proprietary scheme of assigning identifying numbers. Or the schemecan be a scheme known to the public, such as devised by an organizationcalled EPCglobal. EPCglobal's scheme includes numbers that are unique,and are called Electronic Product Code (EPC). In addition, one or moreIIs can be used for the item.

In addition, data 434 is a stored Declared Password (DP). According to acomment 435, DP 434 is a declared password for II 432. In someembodiments, DP 434 can be read from tag 420 separately from II 432. Insome embodiments, DP 434 can be inputted by being interpreted from II432.

Any code can be used as a DP, or a portion of a DP. For example, a DPcan be a binary code, such as 4, 8, or 16 bits long. All or a portion ofit can optionally be generated by a random process, to confound effortsto discern patterns in numbering of tags. Or a portion of the DP candesignate another action pertaining to the item that tag 420 is attachedto, namely it can be a date stamp or time stamp for its receipt, and soon. In addition, one or more DPs can be used for an II.

According to a comment 443, tag 420 is authorized, i.e. consideredlegitimate, if its DP 434 is regarded as proper for its II 432 accordingto a reference database 444. Of course, to preserve the secrecy of whichDPs correspond to which IIs, access to the data of reference database444 is controlled by permissions according to a variety ofpossibilities, as described later in this document.

In some instances, reference database 444 is a default for thetransaction. In other instances, reference database 444 is identifiedwith the help of Reference Database Identifier (RDI) data 436. RDI data436 can be obtained from tag 420, separately from it, e.g.electronically from another party, or both. For example, RDI data 436can be a reference database identifier code.

RDI data 436 can be obtained from tag 420 in a number of ways. One suchway is to scan tag 420 with an RFID reader, and read out RDI data 436along with II data 432 and DP data 434. Another way is to assign an IIsuch that the RDI can be determined from the II 432. One more way is toassign a DP such that the RDI can be determined from the DP 434.

In some instances, reference database 444 is accessible by an electroniccommunications network. This is preferable if reference database 444 ishosted by an Authentication Service for IIs, or the like. In thoseinstances, the first RDI can be used to identify reference database 444in the network. For example, it can include a network address, orcontact information for an operator of the database, such as theAuthentication Service.

As will be realized, a number of implementations are possible. Forexample, one RDI can correspond to one II, and be used to select betweenone or more inputtable IIs. Selection can be according to consistency incoding, locations in tag memory 430 of where data 432, 434, 436 isstored, etc. In addition, one RDI can correspond to one DP, and be usedto select between one or more inputtable DPs, and so on. Multiple RDIscan be available, and one or more can be used for a pair of II and DP toauthenticate tag 420, and so on.

FIG. 5 is a conceptual diagram showing an offered transaction 500 atlink 310 of FIG. 3. An offering party 521 offers (arrow 527) an item 525that is tagged by RFID tag 420 of FIG. 4. Now, however, agent 311 neednot have the same concern shown by thought bubble 343 in FIG. 3.Instead, according to another thought bubble 543, they can authenticatetag 420, and act accordingly.

FIG. 6 is a flowchart 600 illustrating particular methods according toembodiments, for handling RFID-tagged items in a supply chain accordingto authentication of their RFID tags. The methods of flowchart 600 canbe practiced by a party to an exchange or transaction, a partyinspecting items such as a Customs Office, their agent, employee,operator, and so on. The exchange or transaction can be part of aproposed legal agreement as also described elsewhere in this document.Flowchart 600 can thus serve as instructions to party 311 of FIG. 5.

At optional operation 610, a party can be proffered an item, which isassociated with one or more Radio Frequency Identification (RFID) tags.Proffering can be as shown above in FIG. 5. The proffered item can beassociated with one or more Radio Frequency Identification (RFID) tagsin any number of ways. One or more RFID tags can be used for the item.If the item includes individual components, the item may have multipletags, even if each component started out with only one tag. The RFID tagor tags can be attached to the item, or to its package. The attachmentcan be removable or not, and so on, as is known in the art of RFIDtagging.

At next operation 635, it is determined whether an authenticationcondition is met. If it is not met, then at next operation 650, the itemproffered at operation 610 is rejected for the proposed exchange ortransaction. In the case of imports, rejection can be by denyingimportation. At optional next operation 660, another action can betaken, such as returning the item if already delivered, reporting theproposed transaction, confiscating the item for surrendering it toauthorities, destroying it in some circumstances, and so on. If, atoperation 635, the authentication condition is met, then at nextoperation 690, the proffered item is accepted for the exchange ortransaction or importation.

A number of authentication conditions can be used according to theinvention. In the preferred embodiment, the authentication conditionincludes that an Item Identifier (II) can be read from the one or moreRFID tags of operation 610. The readable II can be stored either in asingle tag, or in a combination of tags, which can be cooperating ornot. If the item is scanned by an RFID reader, the II will be read.

According to some optional embodiments, it can be required that,according to operation 640, the II be listed as corresponding to theproffered item in an Item Identifier (II) database 644. This way agent311 can check whether the II of the tag is realistic for the proffereditem. Checking will depend on how II database 644 is hosted.

II database 644 can be hosted so that it is accessible publicly, or withvery few restrictions, such as merely registering a user by name, notaffiliation type. For example, if the II is the EPC, the organizationthat administers them (EPCglobal) can offer a lookup system.

Alternatively, II database 644 can be hosted so that it is accessibleprivately, for one, two, or more parties that have permissions, asindicated by optional II permissions clearance block 641.

As will be realized from this entire document, in some instances itbehooves agent 311 and others in the supply chain to insist that aconsistent Item Identifier be used for each transition or transaction ofthe item, as it advances through the links of the supply chain. This wayverifiability will be improved. One such way is for all to implement awell known and easily accessible system, like the EPC system.

The authentication condition can also include, as indicated at operation670, that the II be authorized. In many embodiments, this means that astored Declared Password (DP) can be inputted from the one or more RFIDtags, and that the DP is regarded as proper for the II, as per areference database, whose data is available only subject to permissions.In some preferred embodiments, the DP is readable from the same RFID tagas the II.

FIG. 7 is a flowchart 700 illustrating preferred embodiments of themethods of FIG. 6. It will be recognized that a number of operations inflowchart 700 are identical to those already described in flowchart 600.

At optional operation 720, an RDI is acquired. The RDI corresponds todata 436 of tag 420, and can be acquired either by scanning the itemthat has tag 420 on it, or be received separately from a partyproffering the item tagged with tag 420, or otherwise be or becomeknown. In some embodiments, it can be required that the RDI be readablefrom the tag as part of the authentication condition.

At optional operation 730, an II is acquired. The II corresponds to data432 of tag 420, and can be acquired either by scanning the item that hastag 420 on it, or be received separately from a party preferring theitem tagged with tag 420, or otherwise be or become known.

Operation 730 enables optional operation 640 to take place. If the II iswrong for item 525, then the proffered item can be rejected, as peroperation 650.

If the II is right for item 525, then it is determined whether the II isauthorized. At a next operation 770, an inputtable DP is acquired. At anext operation 775, it is determined whether the acquired DP is regardedas proper for the acquired II by the reference database identified bythe RDI of operation 720. Execution proceeds according to thedetermination, with accepting the item (operation 690) if the DP isregarded as proper, or rejecting the item (operation 650) if the DP isnot proper.

Operation 775 may be performed in any number of ways, as will be seen inthis document. One such way is to construct a question about whether theacquired II is regarded as proper for the acquired DP, and apply thequestion to the reference database. The reference database can be thesame as was described for reference database 444. Depending on howreference database 444 is hosted, a REF (‘reference database’)permissions clearance block 771 may have to be cleared. REF permissionsclearance block 771 may be the same or different than II permissionsclearance block 641, and represents a group of permissions.

In a preferred embodiment, the REF permissions include that a DP that isindeed regarded as proper for the readable II is generally not revealedto the offeror. It is revealed only indirectly, if the offeror firstdemonstrates they already know of a DP that is regarded as proper forthe readable II. The reason this is preferred is to ensure that anofferor within the not legitimate domain cannot learn a valid DP, andwrite it to the tag memory. It will be understood that, even if theyobtain a valid DP by scanning an authorized similar item, that obtainedDP will become invalid if and when the owner of the authorized similaritem changes the DP, both on the tag and on the reference database.

The REF permissions can include variations. For example, a DP thatpreviously could be determined as regarded as proper for the readable IIcan be revealed to the offeror, but it will be of no more value, and soon.

Another variation is that the same restriction also applies to agent311; in other words, they cannot learn from the reference database thevalid DP, but only get their questions answered about whether a proposedDP is regarded as proper. This way agent 311 learns the valid DP only ifhe first demonstrates he already knew it.

In some embodiments, the REF permissions include that agent 311 needs nopermission to be able to determine whether an inputtable DP is regardedas proper for the readable II by the reference database. This could bewith or without agent 311 being required to merely register as a user byname, and possibly receiving a user code when they log in.

In other embodiments, the REF permissions include that agent 311 needsfurther permissions to be able to determine whether an inputtable DP isregarded as proper for the readable II by the reference database. Insome of these embodiments, they may obtain review privileges, such asfrom the offeror 321. In some of those embodiments, agent 311 can thendeny other privileges to offeror 321, thus continuing the chain ofsuccession. The ability to change the DP is one such opportunity—onceagent 311 changes it upon accepting the proffered item, agent 321 can nolonger change it. There can be also other abilities, such as ability toaccess the readable II, and so on.

The reference database may be local. In other embodiments, the referencedatabase is remote, and accessed over an electronic communicationsnetwork. This is preferred, if the REF permissions of clearance block771 are to be enforced. Another such way is to form a local databasewith data received from the reference database, and then perform thedetermination with the data received in the local database. Thedetermination can be performed by an RFID reader, or related softwarecomponents, or other instrumentalities, as will be seen in FIG. 8.

If the acquired DP is not regarded as proper for the acquired II, asuitable report can be generated, which can be called a lack ofauthentication report. Such a report can be generated by any involvedparty, or even the host itself of the reference database, as will beseen later in this document in more detail. Any number of items can beincluded in the report, such as a time, a date, the acquired II, theacquired DP, and other data about the item being proffered. The lack ofauthentication report, or a version of it, can be caused to betransmitted to a monitoring party, such as a specially contracted party,or a police department. Transmission could be across an electroniccommunications network. In addition, a version of the lack ofauthentication report can be caused to be written to the one or moreRFID tags, if they are available.

In some embodiments, one could determine from operation 780 that theacquired II is not regarded as proper for the acquired DP. In addition,one could further determine that the proffered item has been declared inthe reference database as missing.

As will be realized, the authentication condition can relate only to thetag data. In some embodiments, the party being proffered the item, e.g.party 311, can acquire this data by scanning the tag. It is noteworthythat, in other embodiments, the above described data about the tag canbecome known before the item is received.

More particularly, the II and the DP can be acquired independently fromreceiving the item with the one or more RFID tags. They can be furnishedbefore physically receiving the proffered item with the one or more RFIDtags. For example, party 521 can before actually delivering item 525,learn this data by reading the tag, and then transmit this data to party311 for authentication in advance. If the authentication condition isnot met, then party 311 can reject the proffered item without physicallyreceiving it. In fact, party 311 can inform party 521 to not even botherdelivering. Additionally, if the proffered tagged item is expected butnot physically received when expected, the reference database can beupdated to declare the item as missing.

Additionally, if the proffered tagged item is expected but notphysically received when expected, the reference database can be updatedto declare the item as missing.

In other embodiments, the proffered item is physically received, and theII and the DP are acquired by scanning the delivered item with an RFIDreader. Again, if the DP is regarded as not proper for the II, thedelivered item can be returned without being accepted. Or it can be madeavailable to legal authorities.

In such instances, it is advisable to think of the whole manner of howthe transaction takes place, and also reflect portions of it in thelegal agreements. For example, it could be stipulated what constitutesdelivery, what constitutes acceptance, and so on. Parties may consent inadvance to forfeit items they proffer whose RFID tags do not meet theauthentication condition, and so on.

In other embodiments the proffered item is received and scanned, butmore time is needed to check the authentication condition. Such areceived item can be tentatively stored and held in escrow without beingaccepted. Then it can be determined whether the DP is regarded as properor not for the II. If not, the escrowed item can be returned, or madeavailable to legal authorities, and so on.

In some embodiments, if the DP is regarded as proper for the II, anupdated DP can be caused to be stored in the one or more RFID tags, inlieu of the DP that was stored there. This can be by writing over theDP, or writing the updated DP at a new location of the user memory, andadjusting a pointer, by cross referencing the II with the updated DP. Insome of those embodiments, a whole new II can be written, and so on.This can take place whether the item is tagged with a single tag, or asystem of cooperating tags, and so on. In addition, the referencedatabase is changed, to regard the updated DP as now proper for the II,or the whole new II, etc.

FIG. 8 is a diagram 800 showing an overall arrangement according toembodiments for authenticating the tag of FIG. 5, and implementing amethod of FIG. 6 and FIG. 7. It will be appreciated that arrangement 800can be implemented by any party that wants to determine whether theitems or components they are receiving are legitimate, regardless ofwhether other parties in the chain do not make such a determination.

As in FIG. 5, the proffered item 525 has tag 420. Within link 310 thereis now an RFID reader 810, suitable for scanning item 525 at it isdelivered.

When RFID reader 810 scans item 525, it reads RFID tag 420 as follows.RFID reader 810 transmits an interrogating Radio Frequency (RF) wave812. RFID tag 420 in the vicinity of RFID reader 810 sensesinterrogating RF wave 812, and generates wave 826 in response. RFIDreader 810 senses and interprets wave 826.

Reader 810 and tag 420 exchange data via wave 812 and wave 826. In asession of such an exchange, each encodes, modulates, and transmits datato the other, and each receives, demodulates, and decodes data from theother. The data is modulated onto, and decoded from, RF waveforms.

Encoding the data in waveforms can be performed in a number of differentways. For example, protocols are devised to communicate in terms ofsymbols, also called RFID symbols. A symbol for communicating can be adelimiter, a calibration symbol, and so on. Further symbols can beimplemented for ultimately exchanging binary data, such as “0” and “1”,if that is desired. In turn, when the waveforms are processed internallyby reader 810 and tag 420, they can be equivalently considered andtreated as numbers having corresponding values, and so on.

In this case, data II 432 and data DP 434 are read from the tag, andstored in a memory of reader 810 as respectively data II 832, data DP834, and optionally RDI 836. In the preferred embodiment, data II 432 isidentical to data II 832, and data DP 434 is identical to data DP 834.It could be, however, that first data II 432 is stored in tag 420, whilesecond data II 832 is stored in reader 810, the conversion from thefirst data II 432 to the second data II 832 taking place according tosome rule like an II rule. Similarly, first data DP 434 could be storedin tag 420, while second data DP 834 is stored in reader 810, theconversion from the first to the second taking place according to somerule like a DP rule. Same also with data RDI 836.

RFID reader 810 is now described in more detail, before returning toFIG. 8.

FIG. 9 is a block diagram of a whole RFID reader system 900 according toembodiments. System 900 includes a local block 910, and optionallyremote components 970. Local block 910 and remote components 970 can beimplemented in any number of ways. It will be recognized that reader 810of FIG. 8 is the same as local block 910, if remote components 970 arenot provided. Alternately, reader 810 can be implemented instead bysystem 900, of which only the local block 910 is shown in FIG. 8.

Local block 910 is responsible for communicating with the RFID tags.Local block 910 includes a block 951 of an antenna and a driver of theantenna for communicating with the tags. Some readers, like that shownin local block 910, contain a single antenna and driver. Some readerscontain multiple antennas and drivers and a method to switch signalsamong them, including sometimes using different antennas fortransmitting and for receiving. And some readers contain multipleantennas and drivers that can operate simultaneously. Ademodulator/decoder block 953 demodulates and decodes backscatteredwaves received from the tags via antenna block 951. Modulator/encoderblock 954 encodes and modulates an RF wave that is to be transmitted tothe tags via antenna block 951.

Local block 910 additionally includes an optional local processor 956.Processor 956 may be implemented in any number of ways known in the art.Such ways include, by way of examples and not of limitation, digitaland/or analog processors such as microprocessors and digital-signalprocessors (DSPs); controllers such as microcontrollers; softwarerunning in a machine such as a general purpose computer; programmablecircuits such as Field Programmable Gate Arrays (FPGAs),Field-Programmable Analog Arrays (FPAAs), Programmable Logic Devices(PLDs), Application Specific Integrated Circuits (ASIC), any combinationof one or more of these; and so on. In some cases some or all of thedecoding function in block 953, the encoding function in block 954, orboth, may be performed instead by processor 956.

Local block 910 additionally includes an optional local memory 957.Memory 957 may be implemented in any number of ways known in the art.Such ways include, by way of examples and not of limitation, nonvolatilememories (NVM), read-only memories (ROM), random access memories (RAM),any combination of one or more of these, and so on. Memory 957, ifprovided, can include programs for processor 956 to run, if provided.

In some embodiments, memory 957 stores data read from tags, or data tobe written to tags, such as Electronic Product Codes (EPCs), TagIdentifiers (TIDs) and other data. Memory 957 can also include referencedata that is to be compared to the EPC codes, instructions and/or rulesfor how to encode commands for the tags, modes for controlling antenna951, and so on. In some of these embodiments, local memory 957 isprovided as a database.

Some components of local block 910 typically treat the data as analog,such as the antenna/driver block 951. Other components such as memory957 typically treat the data as digital. At some point there is aconversion between analog and digital. Based on where this conversionoccurs, a whole reader may be characterized as “analog” or “digital”,but most readers contain a mix of analog and digital functionality.

If remote components 970 are indeed provided, they are coupled to localblock 910 via an electronic communications network 980. Network 980 canbe a Local Area Network (LAN), a Metropolitan Area Network (MAN), a WideArea Network (WAN), a network of networks such as the internet, and soon. In turn, local block 910 then includes a local network connection959 for communicating with network 980.

There can be one or more remote component(s) 970. If more than one, theycan be located at the same place with each other, or in differentplaces. They can access each other and local block 910 via network 980,or via other similar networks, and so on. Accordingly, remotecomponent(s) 970 can use respective remote network connections. Only onesuch remote network connection 979 is shown, which is similar to localnetwork connection 959, etc.

Remote component(s) 970 can also include a remote processor 976.Processor 976 can be made in any way known in the art, such as wasdescribed with reference to local processor 956.

Remote component(s) 970 can also include a remote memory 977. Memory 977can be made in any way known in the art, such as was described withreference to local memory 957. Memory 977 may include a local database,and a different database of a Standards Organization, such as one thatcan reference EPCs.

Of the above-described elements, it is advantageous to consider acombination of these components, designated as operational processingblock 990. Block 990 includes those that are provided of the following:local processor 956, remote processor 976, local network connection 959,remote network connection 979, and by extension an applicable portion ofnetwork 980 that links connection 959 with connection 979. The portioncan be dynamically changeable, etc. In addition, block 990 can receiveand decode RF waves received via antenna 951, and cause antenna 951 totransmit RF waves according to what it has processed.

Block 990 includes either local processor 956, or remote processor 976,or both. If both are provided, remote processor 976 can be made suchthat it operates in a way complementary with that of local processor956. In fact, the two can cooperate. It will be appreciated that block990, as defined this way, is in communication with both local memory 957and remote memory 977, if both are present.

Accordingly, block 990 is location agnostic, in that its functions canbe implemented either by local processor 956, or by remote processor976, or by a combination of both. Some of these functions are preferablyimplemented by local processor 956, and some by remote processor 976.Block 990 accesses local memory 957, or remote memory 977, or both forstoring and/or retrieving data.

Reader system 900 operates by block 990 generating communications forRFID tags. These communications are ultimately transmitted by antennablock 951, with modulator/encoder block 954 encoding and modulating theinformation on an RF wave. Then data is received from the tags viaantenna block 951, demodulated and decoded by demodulator/decoder block953, and processed by processing block 990.

FIG. 10 is a block diagram illustrating an overall architecture of aRFID reader system 1000 according to embodiments, which can be used forimplementing of RFID reader 810 and associated components.

RFID reader system 1000 can be implemented as a combination of hardwareand software. It is advantageous to consider such a system as subdividedinto components or modules. Each of these modules may be implemented byitself, or in combination with others. A person skilled in the art willrecognize that some of these components or modules can be implemented ashardware, some as software, some as firmware, and some as a combination.An example of such a subdivision is now described.

It will be recognized that some aspects are parallel with those of FIG.9. In addition, some of them may be present more than once.

RFID reader system 1000 includes one or more antennas 1010, and an RFFront End 1020, for interfacing with antenna(s) 1010. These can be madeas described above. In addition, Front End 1020 typically includesanalog components.

System 1000 also includes a Signal Processing module 1030. In thisembodiment, module 1030 exchanges waveforms with Front End 1020, such asI and Q waveform pairs. In some embodiments, signal processing module1030 is implemented by itself in an FPGA.

System 1000 also includes a Physical Driver module 1040, which is alsoknown as Data Link. In this embodiment, module 1040 exchanges bits withmodule 1030. Data Link 1040 can be the stage associated with framing ofdata. In one embodiment, module 1040 is implemented by a Digital SignalProcessor.

System 1000 additionally includes a Media Access Control module 1050,which is also known as MAC layer. In this embodiment, module 1050exchanges packets of bits with module 1040. MAC layer 1050 can be thestage for making decisions for sharing the medium of wirelesscommunication, which in this case is the air interface. Sharing can bebetween reader system 1000 and tags, or between system 1000 with anotherreader, or between tags, or a combination. In one embodiment, module1050 is implemented by a Digital Signal Processor.

System 1000 moreover includes an Application Programming Interfacemodule 1060, which is also known as API, Modem API, and MAPI. In someembodiments, module 1060 is itself an interface for a user.

System 1000 further includes a host processor 1070. Processor 1070exchanges signals with MAC layer 1050 via module 1060. In someembodiments, host processor 1070 is not considered as a separate module,but one that includes some of the above-mentioned modules of system1000. A user interface 1080 is coupled to processor 1070, and it can bemanual, automatic, or both.

Host processor 1070 can include applications for system 1000. In someembodiments, elements of module 1060 may be distributed betweenprocessor 1070 and MAC layer 1050.

It will be observed that the modules of system 1000 form something of achain. Adjacent modules in the chain can be coupled by the appropriateinstrumentalities for exchanging signals. These instrumentalitiesinclude conductors, buses, interfaces, and so on. Theseinstrumentalities can be local, e.g. to connect modules that arephysically close to each other, or over a network, for remotecommunication.

The chain is used in opposite directions for receiving and transmitting.In a receiving mode, wireless waves are received by antenna(s) 1010 assignals, which are in turn processed successively by the various modulesin the chain. Processing can terminate in any one of the modules. In atransmitting mode, initiation can be in any one of these modules. That,which is to be transmitted becomes ultimately signals for antenna(s)1010 to transmit as wireless waves.

The architecture of system 1000 is presented for purposes ofexplanation, and not of limitation. Its particular subdivision intomodules need not be followed for creating embodiments according to theinvention. Furthermore, the features of the invention can be performedeither within a single one of the modules, or by a combination of them.

Returning now to FIG. 8, reader 810 is coupled via a communication link870 to reference database 444 described above. In this particularembodiment, reference database 444 is provided outside the control oflink 310, although that is not necessarily the case, as will be seenlater in this document.

Link 310 may optionally include a hub 875 within the control of itsagents and employees. Hub 875 is a centralized data processing hub forlink 310, or for the locale of reader 810. In some instances, two hubsmay be provided, one for the link and one for the locale, and so on. Hub875 is coupled with reader 810 via a communication link 870-1, throughwhich data can be exchanged.

In some embodiments, a communications network 890 is provided. Network890 can be an electronic communications network such as the internet.Network 890 is coupled with hub 875 via a communication link 870-2, andwith reference database 444 via a communication link 870-3. As such,links 870-1, 870-2, and 870-3 together form link 870 in this embodiment.

It will be recognized that optional hub 875 and optional network 890 canequivalently be considered parts of reader 810, if one also considersthe descriptions associated with FIG. 9 and FIG. 10.

It is noteworthy that communications from reader 810 and/or hub 875result in transmitting across link 870-3 at least a question signal QSto reference database 444, when a determination is attempted as towhether a read DP 834 is regarded as proper for a read II 832. Moreparticularly, question signal QS is first received by a host ofreference database 444, as will be seen later in this document.

Moreover, an answer signal AS can be transmitted from reference database444 across link 870-3 to hub 875 and/or reader 810. It will berecognized that signals QS and AS can travel all three links 870-1,870-2, 870-3 at once, or at different times, such as for performingbatch jobs. For example, read II and DP data from reader 810 can bestored in hub 875 for many tagged items, and later checked withreference database 444 when traffic via network 890 permits it.

Reference database 444 is hosted by a suitable host 888. Host 888further controls permissions for accessing reference database 444, andperforms other functions, as described in more detail later in thisdocument.

When many links in a supply chain are equipped as shown in FIG. 8,different overall schemes can result. Some such schemes are nowdescribed.

FIG. 11 is a conceptual drawing 1100 of legitimate supply chain 110,where some of the links are equipped like the link of FIG. 8. Further,all use a single reference database 444 for authenticating RFID tags ofitems they are proffered. In diagram 1100, it does not matter where host888 is implemented.

For each of links 120, 130, 140, 150, 160, 170, authentication can takeplace at any suitable portion. Drawing 1100 also shows nodes 1135, 1145,1155, 1165, 1175, and 1179. These nodes are locations within the supplychain where custody of items is transferred, and therefore isadvantageous to have authentication take place there. Of course,authentication can take place at other nodes, and so on.

FIG. 12 is a diagram 1200 of a partial section of a legitimate supplychain 1210 like that of FIG. 11. Chain 1210 includes links 1220, 1230,1240. These include nodes 1235, 1245, which further have communicationlinks 1270 to electronic communications network 890. As also per theabove, network 890 has a communication link 870-3 to host 888, foraccessing the reference database (not shown in FIG. 12).

Host 888 is implemented separately from supply chain 1210 in theseembodiments. In fact, it can be implemented by an Authentication Service1277, whose function relative to supply chain 1210 is to authenticateRFID tags. Accordingly, Authentication Service 1277 can be independent,and even implemented as a business, charging fees for storing data,authenticating, DPs, maintaining users, permissions, generating reports,and the like.

FIG. 13 is a diagram 1300 of a partial section of a legitimate supplychain 1310 like that of FIG. 11. Chain 1310 includes links 1320, 1330,1340. Host 888 is entirely within the control of link 1330, and thus thereference database (not shown in FIG. 13) is also wholly within thecontrol of the owner of link 1330.

Links 1320, 1330, and 1340 include nodes 1325, 1335, 1345, 1349, whichfurther have communication links 1370 with host 888, for accessing thereference database. Some of the links 1370 could use an externalcommunications network, while others need not, as will be determined bya person skilled in the art.

Since the reference database is wholly within the control of the ownerof link 1330, they can set up permissions any way they like. Forexample, they can give more permissions to themselves, than to theagents of the other links.

In fact, a number of schemes are possible that are hybrids of the abovedescribed. Additionally, such schemes can be superimposed on oneanother, with multiple DPs, and even multiple IIs per tag. Suchdeterminations are made by the relative desires of supply chainparticipants, through their link, to control unauthorized items.

FIG. 14 is a block diagram 1488 according to embodiments forimplementing a host such as host 888 for reference database 444. Assuch, host 1488 includes reference database 444, which can be stored ona memory.

Host 1488 also includes machines such as computers, memory storage,programs, data, and the like as will be discerned from a person havingordinary skill in the art. In the embodiment of FIG. 14, host 1488includes a server computer 1410, with a connection 1470 to an electroniccommunications network (not shown). Connection 1470 can be likeconnection 870-3, 1270, 1370, and so on. Additional structures andfeatures of host 1488 are implemented on or supported by server 1410, orother computers, hardware, connected and interoperating as will beevident to a person skilled in the art.

Host 1488 also includes an interface 1420 for checking whether aninputted DP corresponds to an inputted II. As such, interface 1420 maycommunicate with server 1410, reference database 444, and other modulesas designed.

Host 1488 moreover includes a permissions clearance module 1471, forexample for implementing REF permissions clearance 771. Accordinglymodule 1471 may interact with interface 1420 reference database 444, andother modules as designed.

Host 1488 further includes an optional database 1430 for maintainingregistered users, and optionally also their allocated permissions, andso on. As will be realized, database 1430 can be implemented inconjunction with reference database 444.

Host 1488 additionally includes an optional interface 1440 forregistering users, and thus permitting remote users to affect at leastsome of their data in database 1430. It can also include a relatedoptional interface 1450 for registered users to log in, and accessinterface 1420.

Host 1488 can also include an optional report generation module 1460,for generating reports. These reports can include lack of authorizationreports, owner reports, automatic or according to requests, routine orcustom, and so on.

As seen also above, the invention includes methods. Some are methods ofoperation of an RFID reader or RFID reader system. Others are methodsfor controlling an RFID reader or RFID reader system.

These methods can be implemented in any number of ways, including thestructures described in this document. One such way is by machineoperations, of devices of the type described in this document.

Another optional way is for one or more of the individual operations ofthe methods to be performed in conjunction with one or more humanoperators performing some. These human operators need not be collocatedwith each other, but each can be only with a machine that performs aportion of the program.

The invention additionally includes programs, and methods of operationof the programs. A program is generally defined as a group of steps oroperations leading to a desired result, due to the nature of theelements in the steps and their sequence. A program is usuallyadvantageously implemented as a sequence of steps or operations for aprocessor, such as the structures described above.

Performing the steps, instructions, or operations of a program requiresmanipulation of physical quantities. Usually, though not necessarily,these quantities may be transferred, combined, compared, and otherwisemanipulated or processed according to the steps or instructions, andthey may also be stored in a computer-readable medium. These quantitiesinclude, for example, electrical, magnetic, and electromagnetic chargesor particles, states of matter and in the more general case can includethe states of any physical devices or elements. It is convenient attimes, principally for reasons of common usage, to refer to informationrepresented by the states of these quantities as bits, data bits,samples, values, symbols, characters, terms, numbers, or the like. Itshould be borne in mind, however, that all of these and similar termsare associated with the appropriate physical quantities, and that theseterms are merely convenient labels applied to these physical quantities,individually or in groups.

The invention furthermore includes storage media. Such media,individually or in combination with others, have stored thereoninstructions of a program made according to the invention. A storagemedium according to the invention is a computer-readable medium, such asa memory, and is read by a processor of the type mentioned above. If amemory, it can be implemented in a number of ways, such as Read OnlyMemory (ROM), Random Access Memory (RAM), etc., some of which arevolatile and some non-volatile.

Even though it is said that the program may be stored in acomputer-readable medium, it should be clear to a person skilled in theart that it need not be a single memory, or even a single machine.Various portions, modules or features of it may reside in separatememories, or even separate machines. The separate machines may beconnected directly, or through a network such as a local access network(LAN) or a global network such as the Internet.

Often, for the sake of convenience only, it is desirable to implementand describe a program as software. The software can be unitary, orthought in terms of various interconnected distinct software modules.

This detailed description is presented largely in terms of flowcharts,algorithms, and symbolic representations of operations on data bits onand/or within at least one medium that allows computational operations,such as a computer with memory. Indeed, such descriptions andrepresentations are the type of convenient labels used by those skilledin programming and/or the data processing arts to effectively convey thesubstance of their work to others skilled in the art. A person skilledin the art of programming may use these descriptions to readily generatespecific instructions for implementing a program according to thepresent invention.

An economy is achieved in the present document in that a single set offlowcharts is used to describe methods in and of themselves, along withoperations of hardware and/or software. This is regardless of how eachelement is implemented.

Additional methods are now described according to embodiments.

FIG. 15 is a flowchart 1500, illustrating methods to determine anauthentication of RFID tags according to embodiments. Once theauthentication is determined, it will indicate a legitimacy of proffereditems associated with these RFID tags. The methods of flowchart 1500 mayalso be practiced by different embodiments of the invention described inthis document. They can also be practiced by reader 810, by hub 875, bya combination of them, and so on. Data that is input as per the below,e.g. RDI, II, DP, can come from RFID tag 420 read by reader 810, or froman offeror of item 525, or a combination of both, and so on.

At optional operation 1510, a Reference Database Identifier (RDI) isinput. It can be the only RDI, or a first one, with a second RDI beinginputted later. The RDI is input in any number of ways, such asdescribed elsewhere in this document.

The RDI is data, as described above, which is used for identifying thereference database that will be relevant for the method of flowchart1500. In some embodiments, the reference database is local, such as whenit is locally controlled, or has been formed with data received from aremote reference database, which could have permissions, etc.

In other embodiments, the reference database is accessible from anelectronic communications network, and the input RDI to be used tolocate the reference database in the network. For example, it caninclude a network address, or contact information for an operator of thedatabase.

At another operation 1520, a first Item Identifier (II) is input fromone or more RFID tags associated with an item. The first II is input inany number of ways, such as described elsewhere in this document.

At another next operation 1530, a first Declared Password (DP) isobtained from the one or more RFID tags, which corresponds to the firstII. The first DP is input in any number of ways, such as describedelsewhere in this document.

At optional next operation 1540, a question is generated about whetherthe first DP is regarded as proper or not for the first II. The questionis generated in any number of ways, which substantially involvecorrelating the first DP and the first II. In some instances, instead ofthe first DP, the question can use a second DP that is findable from thefirst DP by applying a DP rule. In some instances, instead of the firstII, the question can use a second II that is findable from the first IIby applying an II rule.

The question is then applied to data of a reference database, and ananswer is generated in response to such applying. The reference databasecan be the one identified by the RDI, if one has been input.

At next operation 1550, the answer to the question is input. As per theabove, the answer is preferably as to whether the first DP is regardedas proper or not for the first II.

At optional next operation 1560, it is determined from the answerwhether the first DP is regarded as proper or not for the first II.

If the answer indicates that the first DP is regarded as proper for thefirst II, then the tag is considered authenticated. Accordingly, theproffered item can be considered legitimate, and advance along thesupply chain. Indicators can be triggered, such as a green light at thelocation of the tagged proffered item, and so on.

At an optional next operation 1570, an updated DP is input, and causedto be stored in the reference database, and also in the tag, in lieu ofthe previous DP. Such will help thwart counterfeiting efforts, as willbe described later.

The updated DP can be generated in any number of ways. It can begenerated as part of the method, or inputted externally, such as fromthe reference database. It can be generated from an event, like a timestamp, or at least a portion of it can be generated at random. If atrandom, then it can be checked whether, by some small chance, theat-random actually has a default value that entails a preset custommeaning for the reference database, which should be otherwise avoidedfor a DP. If that is the case, one more DP can be generated and used,and so on.

If the answer indicates that the first DP is regarded as not proper forthe first II, then the tag is not considered authenticated. Accordingly,the proffered item can be considered illegitimate, and be rejected fromthe supply chain. For example, at a next operation 1580, a flag can beset, which would not be set if the answer indicated that the first DP isregarded as proper for the first II. The flag can be set in software,middleware, hardware, and trigger other actions, such as visible oraudible indicators.

Setting the flag can have a number of results. For example, a flashingred light can be triggered by the flag. According to an optionaloperation 1582, an instruction can be generated to reject the proffereditem. According to another next operation 1584, a lack of authenticationreport can be generated, and transmitted as per the above.

FIG. 16 is a diagram 1600 showing individual communications according toembodiments for performing a method such as that of FIG. 15. In thiscase, the question can be transmitted over an electronic communicationsnetwork along link 870 for being applied to reference database 444,accessible via host 888. On the client's side, a client computer 1618can be implemented within link 310, as part of reader 810, or hub 875,or both, depending on what is desired. Computer 1618 has a memory 1628that inputs data 832 II and data 834 DP from reader 810.

Reference database 444 can be accessible via host 888 in a number ofways. In some such ways, no prior authorization or permission is neededby client computer 1618 to receive the answer to the question. In otherinstances, the reference database is accessible such that the answer istransmitted only subject to REF permissions being cleared, as has beendescribed above. This is most easily enforceable when a partytransmitting the question does not have full control of data ofreference database 444, as host 888 is implemented separately. Oftenthese permissions require that a user code be transmitted to the host inconnection with transmitting the question.

The communications between client computer 1618 and host 888 are encodedin question signals QS and answer signals AS. Sample such communicationsare described, where the operator of client computer 1618 is consideredthe user.

According to a communication 1605, the user logs in to the host. Loggingin can also be performed at a time when the user transmits the usercode. Prior to logging in, the user will probably need to register withhost 888, such as in database 1430 of FIG. 14.

According to a communication 1607, communication 1605 is acknowledged.Such acknowledging is often designated as “ACK”. In preferredembodiments, acknowledging 1607 happens in conjunction with permissionsbeing confirmed according to the user code, and prior to generatinganswers.

According to a communication 1645, the user transmits a question as towhether a specific DP is regarded as proper for a specific II, accordingto reference database 444. The question is intended to be applied toreference database 444.

In some embodiments, prior to applying the question, the user needs toobtain additional review privileges from a previous party. Only whenthese are granted from the previous party will the question be appliedto the reference database. This feature is useful when custody of theRFID tagged items changes. Moreover, upon being granted such privileges,the prior party might lose some privileges, e.g. by the user denyingthem to the prior party. And equally, when the user is done, they mightgrant such review privileges to the next party for applying the questionto reference database 444, and so on.

According to a communication 1650, an answer is transmitted to thequestion of communication 1645. It will be recognized that communication1650 is input by client computer 1618 according to operation 1550 ofmethod 1500.

According to a communication 1670, the user transmits an update, whichincludes a new DP that is to be regarded as proper by reference database444 for the II just investigated. It will be recognized that the updateof communication 1670 is the same as in operation 1570 of method 1500.

If this takes place according to permissions, then the update ofcommunication 1670 is permitted only if the answer of communication 1650was yes. As will be described later in this document, such updateseffectively cut off the prior party from knowing any more of a DP thanis regarded as proper for the II of the tag, and thus from being able toupdate the DP.

According to a communication 1679, communication 1670 is acknowledged.Then communications can take place for authenticating data of anothertag, and so on.

Many other actions are also possible. For example, the DP can be causedto no longer be stored as regarded as proper for the II. This can be,for example, by a delete command. Such can happen from a link in thesupply chain beyond which authentication is no longer desired orbeneficial. Deletion can also save in fees if host 888 charges by howlong data is retained.

Alternately, records in reference database 444 may expire on their own,either by agreement, or by planning, or by allocated customer credit. Inthis instance, a deadline can be determining after which the DP will nolonger be confirmable as regarded as proper for the II by referencedatabase 444. If needed, an action can be taken to extend the deadline.The deadline can be determined in any number of ways, such as from thefirst DP.

FIG. 17 is a diagram 1700 showing how data can be organized in areference database according to embodiments. Rows 1744 representrecords, which in diagram represent unexpired entries. Not everypossible II or EPC would be stored as a record, but only those requestedby at least one of the links.

The records show different fields along columns. Column 1732 can be theItem Identifier (II), for which a proprietary or well known number canbe used. In some embodiments, the Electronic Product Code (EPC) can beused for the II.

Column 1734 can hold the value of a last updated Associated Code AC, acode thus associated with the corresponding II of column 1732. The AC islike the good password, which the legitimate tag also uses as itsDeclared Password. The question becomes, given any RFID tag, is its DPthe same as the AC?

For the II whose authorization is being checked, the inputted DP istested for whether it matches the AC that is associated with the II.Matching can be for DP equaling AC exactly, or be different according toa translation rule, and so on. According to some embodiments of the REFpermissions, it is the AC that is not given out to a user, unless theyfirst demonstrate they know it, or they know a DP that is related to itby the translation rule.

Only one column 1734 is shown. If the DP must equal the AC exactly topronounce a match, it means, there is only one AC that the referencedatabase regards as proper for the II. Also that there is only one DPthat the user can enter to authenticate the II. This is preferred as itincreases the robustness of the protection, but not necessary. In fact,the system can be defined so that more than one DPs can be used toauthenticate the II, either by both matching a single AC, or by matchingmore than one ACs defined for the II.

Referring briefly to FIG. 18, an optional use of field 1734 is nowdescribed. All possible AC values are shown in set 1834. In a firstembodiment, any such value can be regarded as proper for an II by thereference database.

In a second embodiment, set 1834 is split into a first subset 1881 and asecond subset 1882. Any AC value in first subset 1881 can be regarded asproper for an II by the reference database. The AC values in secondsubset 1882, however, cannot be regarded as proper for an II, accordingto some definitions.

Second subset 1882 is thus taken out of set 1834 to reserve usefulvalues that can serve as default, and be associated with specialmeanings. For example, if the ACs are 4 bits long, value 0000 can bereserved to designate that the association has recently expired, butcould be revived if a fee is paid. For another example, value 1111 canbe reserved to designate that a previous owner has designated this itemmissing. Of course, other default values and designations are possible,as may be requested.

Second subset 1882 is thus properly regarded as optional. If secondsubset 1882 is provided with at least one such reserved default value,the second embodiment will result. Alternately, if second subset 1882 isthe null set, i.e. having no values, the first embodiment results, whereall AC values can be regarded as proper.

Of course, when updated new DP values are assigned, care should be takenthat they do not by chance be those of second subset 1882. These new DPvalues, from the point of view of the reference database are new ACvalues. When generated they should be checked; and if by any chance theyhave such a default value, another such value should be generated.

Returning now to FIG. 17, all the remaining fields are optional. It isin any event a good idea to maintain them for generating reports.

Column 1752 can hold the user name or user code of a user that enteredthis entry. Column 1754 can hold the date and the time that the entry ofcolumn 1752 was made. Column 1756 can hold the expiration date and timeof a record.

Column 1758 can hold the previous AC of the record, before there was anupdate with the value in column 1734. Column 1762 can hold the presentowner's user name or user code, which may be the party with the mostprivileges. In most embodiments, column 1762 is the same as column 1752.Column 1772 can hold the user name or user code of a declared nextowner, such as someone being granted review privileges as per the above.Other fields are also possible.

It will be further observed that different fields include differentprivacy levels, which means that different ones of them can be revealedto different parties, under different circumstances, and in differentmanners. Many embodiments are possible, such as, for example, the REFpermissions described above. In the example of FIG. 17, according to akey 1784, column 1734 with the IIs has a privacy level A, column 1734with the ACs has a privacy level B, and all the other columns havedifferent privacy levels C, D, etc. Privacy levels and REF permissionscan also be enforced from the host.

FIG. 19 is flowchart 1900 illustrating methods according to otherembodiments of the invention to report on authentication of RFID tags.The methods of flowchart 1900 may also be practiced by differentembodiments of the invention described in this document, such as host888, an Authentication Service 1277, and so on.

It will be recognized that much of this description has many commonaspects with what is already described above, which is why many suchcommon aspects are not repeated for describing flowchart 1900. Plus,much of the description of flowchart 1900 also applies to aspects above.Also, many of the variations below can generate individual components ofan answer that is transmitted.

At optional operation 1910, a log in attempt is received from a user,such as by receiving the above described communication 1605. The log inattempt is just one way for inputting user information, such as a usercode.

At optional operation 1915, it can be verified whether the attempt ofoperation 1910 is from a legitimate user. This can be performed in anumber of ways. For example, it can be verified that the user is withina list of users. In this or a prior step, the user preferably becomesregistered with the list, by meeting the posed requirements and so on.If the user is unauthorized, then at a next optional operation 1917 asuitable operation is performed for the unauthorized user, such asrejecting the log in attempt, creating a report, transmitting an answerthat informs of the status, and so on.

If the user is authorized, at next operation 1920, an Item Identifier(II) is input. As per the above, the II could be an EPC, etc. Morestrictly speaking, a first II is inputted from one or more RFID tagsassociated with an item, and a second II is inputted at operation 1920,which is derived by applying an II rule to the first II. As also per theabove, the first II can be the same as the second II, but that is notnecessary, as long as some rule is followed that correlates the secondII with the first II.

At optional next operation 1925, it is inquired whether the II inputtedat operation 1920 matches one of the IIs in a list of records, such as alist made from fields 1732. If not, then at a next optional operation1927 a suitable operation is performed for the II not on the list, suchas transmitting an answer that informs the user, generating andtransmitting a lack of authentication report as per the above, and soon.

If there is a match at operation 1925, it generally identifies a thirdII that is stored in reference database 444, and matches the second II.To pronounce a match, the third II could be identical to the second II,or not, as long as some rule is followed that correlates the third IIwith the second II.

If the user is authorized, at next operation 1930, a Declared Password(DP) is input. More strictly speaking, a first DP is inputted from theone or more RFID tags associated with the item, and a second DP isinputted at operation 1930, which is derived by applying a DP rule tothe first DP. As also per the above, the first DP can be the same as thesecond DP, but that is not necessary, as long as some rule is followedthat correlates the second DP with the first DP.

Inputting the II at operation 1920 and the DP at operation 1930 isperformed in a context of inputting a question as to whether the secondDP is regarded as proper or not for the second II by reference database444.

At next operation 1935, it is determined whether the DP inputted atoperation 1930 matches an Associated Code (AC) that is stored in thereference database as being associated with the third II. This is if avalue of the AC belongs in first subset 1881 of possible AC values.However, and as per the above, if the value belongs in second subset1882, a mismatch can be pronounced without considering the DP. In fact,the answer can include a customized meaning associated with the value insecond subset 1882, such as “MISSING” or “EXPIRED”. This will not occur,of course, if second subset 1882 is the null set.

If there is a mismatch at operation 1935, then at a next optionaloperation 1937 a suitable operation is performed for the mismatched II,such as transmitting an answer that informs the user, creating a report,and so on.

In some embodiments, it is determined whether the DP has a value thatbelongs in second subset 1882 of possible AC values. If so, operation1937 includes setting an intrusion flag, if it is deemed that this is arogue attempt.

In some embodiments, operation 1937 includes incrementing a failurecounter, which counts failed attempts. Since such failed attempts couldbe suspect, further operations can be controlled in terms of the failurecounter. For example, the failure counter can be reset for the user orthe II, if the inconsistency is resolved otherwise. For another example,if the failure counter exceeds a threshold, further actions can betaken, such as discontinuing generating answers, performing anintervention, and so on.

Before generating an answer to the question, a number of actions cantake place. For example, permissions can be confirmed, such as accordingto the user information, and so on. In some instances, permissions canbe updated, for example upon receiving a suitable request from anotheruser, or granting privileges such as review privileges and so on.

Then an answer can be generated which is also responsive to thequestion, as to whether the DP is regarded as proper for the II.Briefly, it is regarded as proper if the DP matches the AC that isstored in the reference database as being associated with the II in thereference database, and the AC has an AC value that belongs in firstsubset 1881 of AC values that are regarded as proper. And the DP is notregarded as proper if the second DP does not match the AC value or ifthe AC value belongs in second subset 1882 of AC values that areregarded as not proper.

At next operation 1940, the answer is transmitted. The answer can bedirected to any client computer that is requested. A default is totransmit the answer to the client computer from which the II isinputted.

It should be appreciated that, when the answer is transmitted, it causesanswer signal AS to reproduce in a client computer an answer. The sameapplies with all other communications of the type described in FIG. 16.

In some instances the answer is transmitted without the user needing toclear any permissions. In some instances the answer is transmitted onlysubject to REF permissions being cleared.

Referring to FIG. 20, a conceptual diagram 2000 illustrates that host888 of reference database 444 does not reveal an Associated Code (AC),except if it is first demonstrated that a valid DP is already known foran II, according to embodiments of the REF permissions. A table showspossible questions and their answers.

The first question that reveals only the II receives no answer. Withinhost 888, a received II can be used with reference database 444 todetermine the AC associated with the inputted II. But the AC itself isnot reported out in response to the first question. Or it could berevealed, but then immediately changed, so what was revealed is nolonger valid.

The second question furnishes the II of interest, along with theDeclared Password DP. Within host 888, a decision box 2035 determineswhether the DP is equal to the AC. If not, the answer reports that,without revealing the AC. If yes, the user has demonstrated first thatthey know the AC, by having inputted it as the DP.

The advantage of these REF permissions is now described.

Returning to FIG. 19, at optional next operation 1950, an updated AC isstored in the reference database in lieu of the former AC. The updatedAC can be inputted externally or generated and transmitted to the user.At least a portion of it can be generated at random, but then it can bechecked to ensure it does not have a value within the second subset; ifit does, one more AC can be generated and used instead of the second AC.

Referring now to FIG. 21, a diagram 2100 shows the effects of updating,while using a single reference database. For a single Item Identifier(II), different nodes update the AC to different values, from AC1, toAC2, to AC3, to AC4, to AC5, to AC6, to AC7. Each time one link updatesit, none of the other links can update it any more.

An indirect result is that the threat of RFID tag cloning is thwarted.If a legitimate RFID tag is procured, and its II and DP read, this datais useless. Any clones with the same data will not be accepted, once theDP of the legitimate item is updated.

Referring now to FIG. 22, the result can be appreciated. By demandingthat RFID tags can be authenticated before moving on to the next link,the unauthorized items will be thwarted from entering at those links.More particularly, the invention prevents reintroduction activities 237and fraudulent returns 238. When that happens, there is less incentivefor counterfeiting 213, unauthorized overproduction 216 and theft 226.

There are many possible extensions of the invention. One group ofembodiments has to do with deleting records from the reference database,for example as per a deletion request. Or letting them expire after adeadline, after which the answer is not transmitted. There can be agrace period, before which an expired entry can be revived, and afterwhich the result would be different. Also a deadline can be extended andso on. The deadline can be encoded in the AC, and so on.

Numerous details have been set forth in this description, which is to betaken as a whole, to provide a more thorough understanding of theinvention. In other instances, well-known features have not beendescribed in detail, so as to not obscure unnecessarily the invention.

The invention includes combinations and subcombinations of the variouselements, features, functions and/or properties disclosed herein.Elements having been shown in one combination could appear also inanother.

The following claims define certain combinations and subcombinations,which are regarded as novel and non-obvious. Additional claims for othercombinations and subcombinations of features, functions, elements and/orproperties may be presented in this or a related document.

1. A computer comprising: a processor and a storage medium coupled withthe processor, the storage medium having instructions stored thereonwhich, when executed by the processor, result in: the processor derivinga second Item Identifier (II) by applying an II rule to a first II thatthe processor has received from one or more Radio FrequencyIdentification (RFID) tags associated with an item; the processormatching a third II stored in a reference database to the second II; theprocessor deriving a second Declared Password (DP) by applying a DP ruleto a first DP that the processor has received from the one or more RFIDtags in a context of the processor receiving a question as to whetherthe first DP is regarded as proper or not for the first II; theprocessor generating an answer responsive to the question, the answerincluding that the first DP is regarded as proper for the first II ifthe second DP matches a first Associated Code (AC) stored in thereference database and associated with the third II, and the first AChas an AC value that belongs in a first subset of values that areregarded as proper for the third II, and not proper if the second DPdoes not match the AC or if the AC value belongs in a second subset ofvalues that are regarded as not proper for the third II; and theprocessor transmitting the answer.
 2. The computer of claim 1, in whichthe second subset is the null set.
 3. The computer of claim 1, in whichthe first AC is the only AC in the reference database that is regardedas proper for the third II.
 4. The computer of claim 1, in which atleast a portion of the first II includes a designation about the itemassigned according to a proprietary scheme of assigning identifyingnumbers.
 5. The computer of claim 1, in which the first II includes atleast a portion of a code assigned according to a scheme known to thepublic of assigning identifying numbers.
 6. The computer of claim 1, inwhich the first II includes at least a portion of an Electronic ProductCode (EPC).
 7. The computer of claim 1, in which the first DP is abinary code at least 8 bits long.
 8. The computer of claim 1, in whichat least a portion of the first DP has been generated by a randomprocess.
 9. The computer of claim 1, in which at least a portion of thefirst DP designates another action pertaining to the item.
 10. Thecomputer of claim 1, in which the second II is identical to the firstII.
 11. The computer of claim 1, in which the third II is identical tothe second II.
 12. The computer of claim 1, in which the third II iscorrelated to but not identical to the second II.
 13. The computer ofclaim 1, in which the second DP is identical to the first DP.
 14. Thecomputer of claim 1, in which executing the instructions further resultsin: the processor determining whether the second DP has a value thatbelongs in the second subset of possible AC values; and if so, settingan intrusion flag.
 15. The computer of claim 1, in which executing theinstructions further results in: if the first DP is not regarded asproper for the first II, the processor incrementing a failure counter.16. The computer of claim 15, in which executing the instructionsfurther results in: the processor resetting the failure counter.
 17. Thecomputer of claim 15, in which executing the instructions furtherresults in: if the failure counter exceeds a threshold, discontinuinggenerating answers.
 18. The computer of claim 15, in which executing theinstructions further results in: if the failure counter exceeds athreshold, performing an intervention.
 19. The computer of claim 1, inwhich the first II is received from a first client computer, and theanswer is transmitted to the first client computer.
 20. The computer ofclaim 1, in which the answer includes that there is no identified thirdII stored in the reference database that matches the second II.
 21. Thecomputer of claim 1, in which the answer is transmitted without a partyneeding to clear any permissions to receive the answer.
 22. The computerof claim 1, in which the answer is transmitted only subject to REF(‘reference database’) permissions being cleared, the REF permissionsincluding that an AC that is regarded as proper for the third II is notrevealed in the answer unless the question first demonstrates that a DPthat is regarded as proper for the third II is already known.
 23. Thecomputer of claim 22, in which the REF permissions include that a DPthat previously could be determined as regarded as proper for the thirdII can be revealed in the answer.
 24. The computer of claim 1, in whichexecuting the instructions further results in: the processor receivinguser information in connection with receiving the first II, and in whichthe answer is transmitted to a user according to the user information.25. The computer of claim 24, in which executing the instructionsfurther results in: the processor verifying that the user is within alist of approved users.
 26. The computer of claim 24, in which executingthe instructions further results in: the processor registering the userin a list of users.
 27. The computer of claim 24, in which executing theinstructions further results in: the processor confirming permissionsaccording to the user information prior to generating the answer. 28.The computer of claim 27, in which executing the instructions furtherresults in: the processor updating permissions associated with the userinformation responsive to receiving a request from another user.
 29. Thecomputer of claim 1, in which executing the instructions further resultsin: the processor determining whether or not the first DP is regarded asproper for the first II for generating the answer.
 30. The computer ofclaim 29, in which the second DP matches the first AC if it is identicalto it.
 31. The computer of claim 29, in which the second DP matches thefirst AC if it is correlated to it but not identical to it.
 32. Thecomputer of claim 29, in which executing the instructions furtherresults in: if the first DP is not regarded as proper for the first II,further generating a lack of authentication report.
 33. The computer ofclaim 32, in which the lack of authentication report includes at leastone of a time, a date, the second II, and the second DP.
 34. Thecomputer of claim 32, in which executing the instructions furtherresults in: the processor transmitting the lack of authentication reportto a monitoring party.
 35. The computer of claim 29, in which if thefirst DP is not regarded as proper for the first II because the first AChas an AC value belonging in the second subset, then the answer includesa customized meaning associated with the default value.
 36. The computerof claim 35, in which the customized meaning is that an item to whichthe one or more RFID tags are attached has been declared missing by aprior owner of it.
 37. The computer of claim 35, in which the customizedmeaning is that retention of a record for the third II in the referencedatabase has expired.
 38. The computer of claim 29, in which executingthe instructions further results in: if the first DP is regarded asproper for the first II, the processor storing a second AC in thereference database that is regarded as proper for the third II in lieuof the first AC.
 39. The computer of claim 38, in which executing theinstructions further results in: the processor receiving the second AC.40. The computer of claim 38, in which executing the instructionsfurther results in: the processor generating the second AC.
 41. Thecomputer of claim 40, in which at least a portion of the second AC isgenerated at random.
 42. The computer of claim 41, in which theat-random generated portion of the second AC is further checked toensure it does not have a value within the second subset, and if itdoes, generating a third AC and using it instead of the second AC. 43.The computer of claim 1, in which executing the instructions furtherresults in: the processor causing the first AC to no longer be properfor the third II in the reference database.
 44. The computer of claim43, in which the first AC is caused to no longer be proper for the thirdII responsive to receiving a deletion request.
 45. The computer of claim1, in which the third II and the first AC are stored in the referencedatabase in conjunction with a deadline, and the answer is nottransmitted if the deadline has passed.
 46. The computer of claim 45, inwhich executing the instructions further results in: extending thedeadline.
 47. The computer of claim 45, in which the deadline isdetermined from the first AC.
 48. A method, comprising: deriving asecond Item Identifier (II) by applying an II rule to a first II that aprocessor has received from one or more Radio Frequency Identification(RFID) tags associated with an item; matching a third II stored in areference database to the second II by the processor; deriving a secondDeclared Password (DP) by applying a DP rule to a first DP that theprocessor has received from the one or more RFID tags in a context ofreceiving a question as to whether the first DP is regarded as proper ornot for the first II; generating an answer responsive to the question bythe processor, the answer including that the first DP is regarded asproper for the first II if the second DP matches a first Associated Code(AC) stored in the reference database and associated with the third II,and the first AC has an AC value that belongs in a first subset ofvalues that are regarded as proper for the third II, and not proper ifthe second DP does not match the AC or if the AC value belongs in asecond subset of values that are regarded as not proper for the thirdII; and transmitting the answer by the processor.
 49. The method ofclaim 48, in which the second subset is the null set.
 50. The method ofclaim 48, in which the first AC is the only AC in the reference databasethat is regarded as proper for the third II.
 51. The method of claim 48,in which at least a portion of the first II includes a designation aboutthe item assigned according to a proprietary scheme of assigningidentifying numbers.
 52. The method of claim 48, in which the first IIincludes at least a portion of a code assigned according to a schemeknown to the public of assigning identifying numbers.
 53. The method ofclaim 48, in which the first II includes at least a portion of anElectronic Product Code (EPC).
 54. The method of claim 48, in which thefirst DP is a binary code at least 8 bits long.
 55. The method of claim48, in which at least a portion of the first DP has been generated by arandom process.
 56. The method of claim 48, in which at least a portionof the first DP designates another action pertaining to the item. 57.The method of claim 48, in which the second II is identical to the firstII.
 58. The method of claim 48, in which the third II is identical tothe second II.
 59. The method of claim 48, in which the third II iscorrelated to but not identical to the second II.
 60. The method ofclaim 48, in which the second DP is identical to the first DP.
 61. Themethod of claim 48, further comprising: determining by the processorwhether the second DP has a value that belongs in the second subset ofpossible AC values; and if so, setting an intrusion flag.
 62. The methodof claim 48, further comprising: if the first DP is not regarded asproper for the first II, incrementing by the processor a failurecounter.
 63. The method of claim 62, further comprising: resetting thefailure counter by the processor.
 64. The method of claim 62, furthercomprising: if the failure counter exceeds a threshold, discontinuinggenerating answers by the processor.
 65. The method of claim 62, furthercomprising: if the failure counter exceeds a threshold, performing anintervention by the processor.
 66. The method of claim 48, in which thefirst II is received from a first client computer, and the answer istransmitted to the first client computer.
 67. The method of claim 48, inwhich the answer includes that there is no identified third II stored inthe reference database that matches the second II.
 68. The method ofclaim 48, in which the answer is transmitted without a party needing toclear any permissions to receive the answer.
 69. The method of claim 48,in which the answer is transmitted only subject to REF (‘referencedatabase’) permissions being cleared, the REF permissions including thatan AC that is regarded as proper for the third II is not revealed in theanswer unless the question first demonstrates that a DP that is regardedas proper for the third II is already known.
 70. The method of claim 69,in which the REF permissions include that a DP that previously could bedetermined as regarded as proper for the third II can be revealed in theanswer.
 71. The method of claim 48, further comprising: receiving userinformation in connection with receiving the first II by the processor,and in which the answer is transmitted to a user according to the userinformation.
 72. The method of claim 71, further comprising: verifyingthat the user is within a list of approved users by the processor. 73.The method of claim 71, further comprising: registering the user in alist of users by the processor.
 74. The method of claim 71, furthercomprising: confirming permissions according to the user informationprior to generating the answer by the processor.
 75. The method of claim74, further comprising: updating permissions associated with the userinformation responsive to receiving a request from another user by theprocessor.
 76. The method of claim 48, further comprising: determiningwhether or not the first DP is regarded as proper for the first II forgenerating the answer.
 77. The method of claim 76, in which the secondDP matches the first AC if it is identical to it.
 78. The method ofclaim 76, in which the second DP matches the first AC if it iscorrelated to it but not identical to it.
 79. The method of claim 76,further comprising: if the first DP is not regarded as proper for thefirst II, further generating a lack of authentication report.
 80. Themethod of claim 79, in which the lack of authentication report includesat least one of a time, a date, the second II, and the second DP. 81.The method of claim 79, further comprising: transmitting the lack ofauthentication report to a monitoring party by the processor.
 82. Themethod of claim 76, in which if the first DP is not regarded as properfor the first II because the first AC has an AC value belonging in thesecond subset, then the answer includes a customized meaning associatedwith the default value.
 83. The method of claim 82, in which thecustomized meaning is that an item to which the one or more RFID tagsare attached has been declared missing by a prior owner of it.
 84. Themethod of claim 82, in which the customized meaning is that retention ofa record for the third II in the reference database has expired.
 85. Themethod of claim 76, further comprising: if the first DP is regarded asproper for the first II, storing by the processor a second AC in thereference database that is regarded as proper for the third II in lieuof the first AC.
 86. The method of claim 85, further comprising:receiving the second AC.
 87. The method of claim 85, further comprising:generating the second AC by the processor.
 88. The method of claim 87,in which at least a portion of the second AC is generated at random. 89.The method of claim 88, in which the at-random generated portion of thesecond AC is further checked to ensure it does not have a value withinthe second subset, and if it does, generating a third AC and using itinstead of the second AC.
 90. The method of claim 48, furthercomprising: causing the first AC to no longer be proper for the third IIin the reference database.
 91. The method of claim 90, in which thefirst AC is caused to no longer be proper for the third II responsive toreceiving a deletion request.
 92. The method of claim 48, in which thethird II and the first AC are stored in the reference database inconjunction with a deadline, and the answer is not transmitted if thedeadline has passed.
 93. The method of claim 92, further comprising:extending the deadline.
 94. The method of claim 92, in which thedeadline is determined from the first AC.
 95. A method, comprising:causing, in response to receiving a question signal from a clientcomputer, an answer signal to be produced in a host system about whethera first Declared Password (DP) is regarded as proper or not for a firstItem Identifier (II), in which a second II is derived by a processor ofthe host system applying an II rule to the first lI the processor hasreceived from one or more Radio Frequency Identification (RFID) tagsassociated with an item, the second II is matched against a third IIstored in a reference database; a second DP is derived by the processorof the host system applying a DP rule to first DP the processor hasreceived from the one or more RFID tags, and the answer signal includesthat the first DP is regarded as proper for the first II if the secondDP matches a first Associated Code (AC) stored in the reference databaseassociated with the third II, and the first AC has an AC value thatbelongs in a first subset of values that are regarded as proper for thethird II, and not proper if the second DP does not match the AC or ifthe AC value belongs in a second subset of values that are regarded asnot proper for the third II.
 96. The method of claim 95, in which thesecond subset is the null set.
 97. The method of claim 95, in which thefirst AC is the only AC in the reference database that is regarded asproper for the third II.
 98. The method of claim 95, in which at least aportion of the first II includes a designation about the item assignedaccording to a proprietary scheme of assigning identifying numbers. 99.The method of claim 95, in which the first II includes at least aportion of a code assigned according to a scheme known to the public ofassigning identifying numbers.
 100. The method of claim 95, in which thefirst II includes at least a portion of an Electronic Product Code(EPC).
 101. The method of claim 95, in which the first DP is a binarycode at least 8 bits long.
 102. The method of claim 95, in which thesecond DP is identical to the first DP.
 103. The method of claim 95, inwhich at least a portion of the first DP has been generated by a randomprocess.
 104. The method of claim 95, in which at least a portion of thefirst DP designates another action pertaining to the item.
 105. Themethod of claim 95, in which the second II is identical to the first II.106. The method of claim 95, in which the third II is identical to thesecond II.
 107. The method of claim 95, in which the third II iscorrelated to but not identical to the second II.
 108. The method ofclaim 95, in which it is further determined whether the second DP has avalue that belongs in the second subset of possible AC values; and ifso, setting an intrusion flag.
 109. The method of claim 95, in which theanswer signal includes that there is no identified third II stored inthe reference database that matches the second II.
 110. The method ofclaim 95, in which the question signal is received by the host systemwithout confirming whether the client computer belongs to a client withany permissions.
 111. The method of claim 95, in which the questionsignal is received by the host system only after confirming the clientcomputer belongs to a client with appropriate permissions.
 112. Themethod of claim 95, in which the question signal is received by the hostsystem only after confirming the client computer belongs to a clientthat clears REF (‘reference database’) permissions, the REF permissionsincluding that an AC that is regarded as proper for the third II is notrevealed in the answer signal unless the question first demonstratesthat a DP that is regarded as proper for the third II is already known.113. The method of claim 112, in which the REF permissions include thata DP that previously could be regarded as proper for the third II can berevealed in the answer signal.
 114. The method of claim 95, in which thequestion signal is received by the host system only after confirmingthat the client computer belongs to a client within a prestored list.115. The method of claim 114, further comprising: confirming permissionsfor the client prior to generating the answer signal.
 116. The method ofclaim 115, further comprising: updating permissions associated with theclient responsive to receiving a request from an other user.
 117. Themethod of claim 95, in which the second DP matches the first AC if it isidentical to it.
 118. The method of claim 95, in which the second DPmatches the first AC if it is correlated to it but not identical to it.119. The method of claim 95, further comprising: if the first DP is notregarded as proper for the first II, causing to be generated a lack ofauthentication report.
 120. The method of claim 119, in which the lackof authentication report includes at least one of a time, a date, thesecond II, and the second DP.
 121. The method of claim 119, furthercomprising: causing a report signal to produce the lack ofauthentication report in a monitoring party's client computer.
 122. Themethod of claim 95, in which if the first DP is not regarded as properfor the first II because the first AC has a default value belonging inthe second subset, then the answer signal further includes a customizedmeaning associated with the default value.
 123. The method of claim 122,in which the customized meaning is that an item to which the one or moreRFID tags are attached has been declared missing by a prior owner of it.124. The method of claim 122, in which the customized meaning is thatretention of a record for the third II in the reference database hasexpired.
 125. The method of claim 95, further comprising: causing anupdate acknowledgment signal to produce in a second client computer aconfirmation that a second AC has been stored in lieu of the first AC inthe reference database as being regarded as proper for the third II.126. The method of claim 125, in which the client computer is the sameas the second client computer.
 127. The method of claim 125, in whichthe second AC has been learned from a transmission of one of the clientcomputer and the second client computer.
 128. The method of claim 125,further comprising: causing an update data signal to produce in one ofthe client computer and the second client computer the second AC. 129.The method of claim 128, in which the second AC has been generated atrandom at least in part.
 130. The method of claim 128, in which thesecond AC has been generated responsive to having received the questionsignal.
 131. The method of claim 95, further comprising: if the first DPis regarded as proper for the first II, causing an updated first DP tobe stored in one of: the reference database and the one or more RFIDtags.